Convergence of Iterative Scoring Rules

Convergence of iterative voting

In multiagent systems, social choice functions can help aggregate the distinct preferences that agents have over alternatives, enabling them to settle on a single choice. Despite the basic manipulability of all reasonable voting systems, it would still be desirable to find ways to reach a stable result, i.e., a situation where no agent would wish to change its vote. One possibility is an iterat...

Convergence and Quality of Iterative Voting Under Non-Scoring Rules

Iterative voting is a social choice mechanism whereby voters are allowed to continually make strategic changes to their stated preferences until no further change is desired. We study the iterative voting framework for several common voting rules and show that, for these rules, an equilibrium may never be reached. We also consider several variations of iterative voting and show that with these ...

On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces

In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.

Convergence of iterative methods applied to Burgers-Huxley equation

Convergence of an Iterative Scheme for Multifunctions on Fuzzy Metric Spaces

Recently, Reich and Zaslavski have studied a new inexact iterative scheme for fixed points of contractive and nonexpansive multifunctions. In 2011, Aleomraninejad, et. al. generalized some of their results to Suzuki-type multifunctions.  The study of iterative schemes for various classes of contractive and nonexpansive mappings is a central topic in fixed point theory. The importance of Banach ...